Understanding the Mulmuley-Sohoni Approach to P vs. NP
نویسنده
چکیده
We explain the essence of K. Mulmuley and M. Sohoni, “Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems” [MS02] for a general complexity-theory audience. We evaluate the power and prospects of the new approach. The emphasis is not on probing the deep mathematics that underlies this work, but rather on helping computational complexity theorists not versed in its background to understand the combinatorics involved.
منابع مشابه
Project Summary: quantizing Schur functors
Geometric complexity theory (GCT) is an approach to P vs. NP and related problems in complexity theory using algebraic geometry and representation theory. A fundamental problem in representation theory, believed to be important for this approach, is the Kronecker problem, which asks for a positive combinatorial formula for the multiplicity gλμν of an irreducible representation Mν of the symmetr...
متن کاملDiscrete Geometry and Computational Representation Theory: A Research Statement
The question whether P 6= NP is widely regarded to be one of the most important outstanding problems in modern mathematics [39]. I work in an emerging intersection of three areas of mathematics which recent developments suggest may provide new test cases and perhaps new insight into this problem. These three areas are computational representation theory, polyhedral geometry, and theoretical com...
متن کاملReport on "Mathematical Aspects of P vs. NP and its Variants."
This is a report on a workshop held August 1 to August 5, 2011 at the Institute for Computational and Experimental Research in Mathematics (ICERM) at Brown University, Providence, Rhode Island, organized by Saugata Basu, Joseph M. Landsberg, and J. Maurice Rojas. We provide overviews of the more recent results presented at the workshop, including some works-in-progress as well as tentative and ...
متن کاملGeometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
In [26], henceforth referred to as Part I, we suggested an approach to the P vs. NP and related lower bound problems in complexity theory through geometric invariant theory. In particular, it reduces the arithmetic (characteristic zero) version of the NP 6⊆ P conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in a variety associated wi...
متن کاملHypersurfaces with degenerate duals and the Geometric Complexity Theory Program
We determine set-theoretic defining equations for the variety Dualk,d,N ⊂ P(S d C N ) of hypersurfaces of degree d in C that have dual variety of dimension at most k. We apply these equations to the Mulmuley-Sohoni variety GLn2 · [detn] ⊂ P(S n C n2), showing it is an irreducible component of the variety of hypersurfaces of degree n in C 2 with dual of dimension at most 2n − 2. We establish add...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 78 شماره
صفحات -
تاریخ انتشار 2002